Variable neighbourhood search in commercial VRP packages: evolving towards self-adaptive methods
نویسندگان
چکیده
All commercial packages for vehicle routing that the authors are aware of use some form of variable neighbourhood search. This paper attempts to answer the question why this is the case. As we will show, variable neighbourhood search can be considered to be a very adaptable metaheuristic, which makes it especially suitable for the practical problems encountered in real life. We also point out that there is a need for the VNS applications used in commercial packages to evolve towards more self-adapting systems.
منابع مشابه
Automating the Generation of VNS Components with Grammatical Evolution
The vehicle routing problem (VRP) is a family of problems whereby a fleet of vehicles must service the commodity demands of a set of geographically scattered customers from one or more depots, subject to a number of constraints. Early hyper-heuristic research focussed on selecting and applying a low-level heuristic at a given stage of an optimisation process. Recent trends have led to a number ...
متن کاملGeneration of VNS Components with Grammatical Evolution for Vehicle Routing
The vehicle routing problem (VRP) is a family of problems whereby a fleet of vehicles must service the commodity demands of a set of geographically scattered customers from one or more depots, subject to a number of constraints. Early hyper-heuristic research focussed on selecting and applying a low-level heuristic at a given stage of an optimisation process. Recent trends have led to a number ...
متن کاملApplication of heuristic methods for conformance test selection
In this paper we focus on the test selection problem. It is modeled after a real-life problem that arises in telecommunication when one has to check the reliability of an application. We apply different metaheuristics, namely Reactive Tabu Search (RTS), Genetic Algorithms (GA) and Simulated Annealing (SA) to solve the problem. We propose some modifications to the conventional schemes including ...
متن کاملA Simulated Annealing Hyper-heuristic: Adaptive Heuristic Selection for Different Vehicle Routing Problems
One of the motivations of hyper-heuristic research is to investigate the development of adaptive decision support systems that can be applied to a range of different problems and different problem instances [5]. One possible approach is to dynamically adjust the preferences of a set of simple lowlevel heuristics (or neighbourhood operators) during the search. Hyper-heuristics have been used to ...
متن کاملA Simulated Annealing Algorithm within the Variable Neighbourhood Search Framework to Solve the Capacitated Facility Location-Allocation Problem
In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...
متن کامل